A Nonoverlapping Domain Decomposition Method for Maxwell's Equations in Three Dimensions
نویسندگان
چکیده
In this paper, we propose a nonoverlapping domain decomposition method for solving the three-dimensional Maxwell equations, based on the edge element discretization. For the Schur complement system on the interface, we construct an efficient preconditioner by introducing two special coarse subspaces defined on the nonoverlapping subdomains. It is shown that the condition number of the preconditioned system grows only polylogarithmically with the ratio between the subdomain diameter and the finite element mesh size but possibly depends on the jumps of the coefficients.
منابع مشابه
Numerical Experiments for a Nonoverlapping Domain Decomposition Method for Partial Differential Equations
We present numerical experiments for a nonoverlapping domain decomposition method with interface relaxation for general selfadjoint and non-selfadjoint elliptic problems in two dimensions. The procedure contains two steps in each full iteration. The transmission condition on the interface is taken to be Dirichlet in the rst step and Neumann in the second. However, in the presence of interior su...
متن کاملA Parallel Implementation of an Iterative Substructuring Algorithm for Problems in Three Dimensions
Numerical results from a parallel implementation of an iterative substructuring algorithm are reported. The algorithm is for solving scalar, self-adjoint elliptic partial diierential equations in three dimensions. Results are given for two variants of the algorithm. In the rst variant, exact interior solvers are used; in the second, one multigrid V-cycle is used to approximately solve the inter...
متن کاملA Characteristic Nonoverlapping Domain Decomposition Method for Multidimensional Convection-Diffusion Equations
We develop a quasi-two-level, coarse-mesh-free characteristic nonoverlapping domain decomposition method for unsteady-state convection-diffusion partial differential equations in multidimensional spaces. The development of the domain decomposition method is carried out by utilizing an additive Schwarz domain decomposition preconditioner, by using an Eulerian-Lagrangian method for convection-dif...
متن کاملSome Nonoverlapping Domain Decomposition Methods
The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for solving second-order elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuring–type methods and the Neumann–Neumann-type methods. The basic framework used for analysis is the parallel subspace correction met...
متن کاملAn Iterative Substructuring Algorithm for Problems in Three Dimensions
In domain decomposition algorithms with more than a few subdomains, there is a crucial need for a mechanism to provide for global communication of information at each step of the iterative process. The convergence rate will decay rapidly with an increasing number of subdomains if communication is only between neighboring subdomains. For iterative substructuring algorithms (those domain decompos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 41 شماره
صفحات -
تاریخ انتشار 2003